A Polynomial Time Algorithm For Solving Clique Problems
نویسنده
چکیده
In this paper, I submit an algorithm that efficiently solves the problems k-clique, maximum clique, and complete enumeration of all maximal cliques for any given graph that I have written in the Java programming language. I will first give a high level overview of how the cliques are calculated using this algorithm and show a more in depth look as to how my algorithm works as well as present the code I have written. I will detail how to use it and how to obtain a copy of it.
منابع مشابه
A Refutation of the Clique-Based P=NP Proofs of LaPlante and Tamta-Pande-Dhami
In this work, we critique two papers, “A Polynomial-Time Solution to the Clique Problem” by Tamta, Pande, and Dhami [3], and “A Polynomial-Time Algorithm For Solving Clique Problems” by LaPlante [1]. We summarize and analyze both papers, noting that the algorithms presented in both papers are flawed. We conclude that neither author has successfully established that P = NP.
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملA New Play-off Approach in League Championship Algorithm for Solving Large-Scale Support Vector Machine Problems
There are many numerous methods for solving large-scale problems in which some of them are very flexible and efficient in both linear and non-linear cases. League championship algorithm is such algorithm which may be used in the mentioned problems. In the current paper, a new play-off approach will be adapted on league championship algorithm for solving large-scale problems. The proposed algori...
متن کاملFinding the Number of Members with Certain Relationships in Social Networks and Big Size Organizations using Copositive Programming
In social networks and big size organizations, finding the number of members that all of them have a certain relationship w* is an important problem for managers, as well the number of members that none of them has not the relationship (w*). Considering the members as vertices and the relationship as edges, w* and w* denote the clique number and the number of edges in the independent graph, re...
متن کاملA Machine Model for the Complexity of NP-Approximation Problems
Many introductions to the theory of NP-completeness make some mention of approximating NP-complete problems. The usual story line says that even though solving an NP-complete problem exactly may be intractable, it is sometimes possible to find an approximate solution in polynomial time. The intuitive assumption is that finding an approximate solution should be easier than finding the exact solu...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1503.04794 شماره
صفحات -
تاریخ انتشار 2015